A lower bound on IMMSE �
نویسنده
چکیده
This paper provides upper and lower bounds on the information rates achievable with a minimum mean square error (MMSE) Tomlinson-Harashima precoder (THP) assuming ideal interleaving. We also give an exact formula for zero-forcing (ZF) THP achievable information rates. At high SNR, the performance of the MMSE-THP and the ZF-THP identically suuer only the 2.55 bit or 1.53 dB \shaping" loss from capacity. At low SNR, shaping loss is negligible, but the THP systems again do not achieve capacity, largely due to the receiver modulo operation (and interleav-ing in the MMSE case). In general, the MMSE-THP outperforms the ZF-THP at low SNR. We show these eeects for an example ISI channel.
منابع مشابه
Noncooperative Optimization of Space-Time Signals in Ad hoc Networks
Recent results on noncooperative space-time waveform optimization for Ad hoc networks are first reviewed. The optimization criterion is sum power minimization under a QoS constraint (decoupled capacity.) Noncooperative iterative minimum mean-square (IMMSE) algorithms are advocated here as a pragmatic solution to the QoS constrained optimization problem. Connections between IMMSE, time-reversal ...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
متن کامل